CS364B: Frontiers in Mechanism Design Lecture #19: Interim Rules and Border’s Theorem∗
نویسنده
چکیده
In this lecture we continue our study of revenue-maximization in multi-parameter problems. Unlike Lectures #1–17, where we focused entirely on welfare maximization, here we strive to maximize the sum of the payments from the bidders to the mechanism. Since there is no “always optimal” mechanism, akin to the VCG mechanism for welfare-maximization, we compare the performance of different auctions using a prior distribution over valuations. Last lecture, we recalled Myerson’s well-understood and satisfying single-parameter theory: maximizing expected revenue reduces to maximizing virtual welfare, where the virtual valuation of a bidder is a relatively simple formula of its valuation and the prior distribution. This reduction is interesting both conceptually and computationally. First, it tells us what optimal auctions looks like — they are virtual welfare maximizers. They are DSIC — even though we optimize over the richer space of BIC mechanisms — and with regular distributions, they are deterministic. Second, it implies that in every setting where welfare-maximization is computational tractable, revenue-maximization with respect to a prior is also tractable. The goal of this lecture and the next is to develop a multi-parameter analog of Myerson’s theorem. Even though Myerson’s paper is almost 35 years old [2], some of the most interesting progress on this question is from just the last year or two. Last lecture, we say that revenue-maximizing auctions are more complex in multi-parameter settings than in single-parameter ones. This is true even with just one buyer — where with one good, the optimal selling procedure is a take-it-or-leave-it offer at a monopoly price. With only two items and a buyer with an additive valuation drawn from extremely simple prior distributions, the optimal auction format varies significantly with the details of the prior and need not be deterministic. This means the optimal auctions need not be (deterministic) virtual welfare maximizers. It also seems unrealistic to expect tractable closed-formulas for
منابع مشابه
CS364B: Frontiers in Mechanism Design Lecture #20: Characterization of Revenue-Maximizing Auctions∗
Recall what we are shooting for: a multi-parameter analog of Myerson’s theory of revenuemaximizing optimal auctions. Single-parameter optimal mechanisms are virtual welfare maximizers. We’ve seen that multi-parameter optimal mechanisms are generally randomized. It would seem that the coolest statement that could be true is: revenue-maximizing optimal auctions for multi-parameter problems are al...
متن کاملCS364B: Frontiers in Mechanism Design Lecture #9: MIDR Mechanisms via Scaling Algorithms∗
Theorem 1.1 If k ≥ c logm 2 for a sufficiently large constant c, then there is a randomized algorithm with expected polynomial running time that, with probability 1, outputs a feasible allocation with welfare at least 1− times the maximum possible. ∗ c ©2014, Tim Roughgarden. †Department of Computer Science, Stanford University, 462 Gates Building, 353 Serra Mall, Stanford, CA 94305. Email: tim...
متن کاملCs364b: Frontiers in Mechanism Design Lecture #7: Submodular Valuations
With this lecture we commence Part II of the course. We continue to pursue very strong incentive guarantees (i.e., DSIC mechanisms) in scenarios where the underlying welfaremaximization problem is NP-hard. This turns out to be a very difficult quest; the goal of this part of the course is to highlight the challenges involved and survey what few design techniques and positive results are known. ...
متن کاملCS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗
Recall that the submodularity condition in (1) is a form of diminishing returns, but is strictly weaker than the gross substitute condition. If we ignore incentives and assume straightforward bidding, the Kelso-Crawford auction achieves a 1 2 -approximation of the optimal welfare. Another 1 2 -approximation is given in Exercise #25. Are there DSIC mechanisms with equally good guarantees? While ...
متن کاملCS364B: Frontiers in Mechanism Design Lecture #16: The Price of Anarchy in First-Price Auctions
In this lecture we pass from second-price to first-price auctions — auctions where you pay your bid. We haven’t said much about pay-as-bid auctions in this or the previous course. The reason is that we’ve been focusing on auctions that are easy to participate in and that have strong incentive guarantees, like dominant-strategy incentive-compatibility. In this part of the course, where we focus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014